The poset of closure systems on an infinite poset: detachability and semimodularity
نویسندگان
چکیده
منابع مشابه
An infinite combinatorial statement with a poset parameter
We introduce an extension, indexed by a partially ordered set P and cardinal numbers κ, λ, denoted by (κ,<λ) ; P , of the classical relation (κ, n, λ) → ρ in infinite combinatorics. By definition, (κ, n, λ) → ρ holds if every map F : [κ] → [κ] has a ρ-element free set. For example, Kuratowski’s Free Set Theorem states that (κ, n, λ) → n + 1 holds iff κ ≥ λ+n, where λ+n denotes the n-th cardinal...
متن کاملOn Poset Merging∗
We consider the follow poset merging problem: Let X and Y be two subsets of a partially ordered set S. Given complete information about the ordering within both X and Y , how many comparisons are needed to determine the order on X ∪ Y ? This problem is a natural generalization of the list merging problem. While searching in partially ordered sets and sorting partially ordered sets have been con...
متن کاملOn Poset Sandwich Problems
A graph Gs = (V,Es) is a sandwich for a pair of graph Gt = (V,Et) and G = (V,E) if Et ⊆ Es ⊆ E. Any poset, or partially ordered set, admits a unique graph representation which is directed and transitive. In this paper we introduce the notion of sandwich poset problems inspired by former sandwich problems on comparability graphs. In particular, we are interested in seriesparallel and interval po...
متن کاملOn Poset Boolean Algebras
Let 〈P,≤〉 be a partially ordered set. We define the poset Boolean algebra of P , and denote it by F (P ). The set of generators of F (P ) is {xp : p ∈ P}, and the set of relations is {xp ·xq = xp : p ≤ q}. We say that a Boolean algebra B is well-generated, if B has a sublattice G such that G generates B and 〈G,≤G〉 is well-founded. A wellgenerated algebra is superatomic. Theorem 1 Let 〈P,≤〉 be a...
متن کاملOn an extremal problem for poset dimension
Let f(n) be the largest integer such that every poset on n elements has a 2-dimensional subposet on f(n) elements. What is the asymptotics of f(n)? It is easy to see that f(n) > n. We improve the best known upper bound and show f(n) = O(n). For higher dimensions, we show fd(n) = O ( n d d+1 ) , where fd(n) is the largest integer such that every poset on n elements has a d-dimensional subposet o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Portugaliae Mathematica
سال: 2010
ISSN: 0032-5155
DOI: 10.4171/pm/1872